Search-based many-to-one component substitution

Search-based many-to-one component substitution

In this paper, we present a search-based automatic many-to-one component substitution mechanism. When a component is removed from an assembly to overcome component obsolescence, failure or unavailability, most existing systems perform component-tocomponent (one-to-one) substitution. Thus, they only handle situations where a specific candidate component is available. As this is not the most freq...

Extending a logi based one - to - one negotiationframework to one - to - many

Many Worlds in One: The Search for Other Universes

www.physicstoday.org on many of the topics in the text; his experience is reflected in the interesting and cohesive perspectives related to the different subjects discussed and in the adaptation of calculations from his own work to new, substantial, and intriguing problems. Each chapter has two short introductions: one to outline its contents and the other to discuss the exercises at the end of...

Continuous and Discrete Search for One of Many Objects

By an easy observation we show that the basic result of Blackwell, according to which the most inviting strategy is optimal in a discrete search for one object, is also true when the number of objects is random provided the search is made in continuous time. This result does not hold in the discrete search model even when only two boxes are present (contrary to a conjecture of Smith and Kimeldo...

One Way to Select Many

Selecting items from a collection is one of the most common tasks users perform with graphical user interfaces. Practically every application supports this task with a selection feature different from that of any other application. Defects are common, especially in manipulating selections of non-adjacent elements, and flexible selection features are often missing when they would clearly be usef...